Orthogonal Sparse PCA and Covariance Estimation via Procrustes Reformulation
نویسندگان
چکیده
منابع مشابه
Sparse PCA via Covariance Thresholding
In sparse principal component analysis we are given noisy observations of a low-rank matrix of dimension n × p and seek to reconstruct it under additional sparsity assumptions. In particular, we assume here each of the principal components v1, . . . ,vr has at most s0 non-zero entries. We are particularly interested in the high dimensional regime wherein p is comparable to, or even much larger ...
متن کاملScalable Sparse Covariance Estimation via Self-Concordance
We consider the class of convex minimization problems, composed of a self-concordant function, such as the log det metric, a convex data fidelity term h(·) and, a regularizing – possibly non-smooth – function g(·). This type of problems have recently attracted a great deal of interest, mainly due to their omnipresence in top-notch applications. Under this locally Lipschitz continuous gradient s...
متن کاملCovariance Estimation via Sparse Kronecker Structures
The problem of estimating covariance matrices is central to statistical analysis and is extensively addressed when data are vectors. This paper studies a novel Kronecker-structured approach for estimating such matrices when data are matrices and arrays. Focusing on matrix-variate data, we present simple approaches to estimate the row and the column correlation matrices, formulated separately vi...
متن کاملOrthogonal Procrustes Analysis for Dictionary Learning in Sparse Linear Representation
In the sparse representation model, the design of overcomplete dictionaries plays a key role for the effectiveness and applicability in different domains. Recent research has produced several dictionary learning approaches, being proven that dictionaries learnt by data examples significantly outperform structured ones, e.g. wavelet transforms. In this context, learning consists in adapting the ...
متن کاملSparse Covariance Selection via Robust Maximum Likelihood Estimation
We address a problem of covariance selection, where we seek a trade-off between a high likelihood against the number of non-zero elements in the inverse covariance matrix. We solve a maximum likelihood problem with a penalty term given by the sum of absolute values of the elements of the inverse covariance matrix, and allow for imposing bounds on the condition number of the solution. The proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2016
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2016.2605073